A Multi-Layer Regression based Predicable Function Fitting Network

Function plays an important role in mathematics and many science branches. As the fast development of computer technology, more and more study on computational function analysis, e.g., Fast Fourier Transform, Wavelet Transform, Curve Function, are presented in these years. However, there are two main problems in these approaches: 1) hard to handle the complex functions of stationary and non-stationary, periodic and non-periodic, high order and low order; 2) hard to generalize the fitting functions from training data to test data. In this paper, a multiple regression based function fitting network that solves the two main problems is introduced as a predicable function fitting technique. This technique constructs the network includes three main parts: 1) the stationary transform layer, 2) the feature encoding layers, and 3) the fine tuning regression layer. The stationary transform layer recognizes the order of input function data, and transforms non-stationary function to stationary function. The feature encoding layers encode the raw input sequential data to a novel linear regression feature that can capture both the structural and the temporal characters of the sequential data. The fine tuning regression layer then fits the features to the target ahead values. The fitting network with the linear regression feature layers and a non-linear regression layer come up with high quality fitting results and generalizable predictions. The experiments of both mathematic function examples and the real word function examples verifies the efficiency of the proposed technique.Comment: 14 pages, 3 figure

Dirichlet Boundary Value Problems for Second Order pp-Laplacian Difference Equations

In this paper, the solutions to second order Dirichlet boundary value problems of $p$-Laplacian difference equations are investigated. By using critical point theory, existence and multiplicity results are obtained. The proof is based on the Mountain Pass Lemma in combination with variational techniques

Fuzzy aesthetic semantics description and extraction for art image retrieval

AbstractMore and more digitized art images are accumulated and expanded in our daily life and techniques are needed to be established on how to organize and retrieve them. Though content-based image retrieval (CBIR) made great progress, current low-level visual information based retrieval technology in CBIR does not allow users to search images by high-level semantics for art image retrieval. We propose a fuzzy approach to describe and to extract the fuzzy aesthetic semantic feature of art images. Aiming to deal with the subjectivity and vagueness of human aesthetic perception, we utilize the linguistic variable to describe the image aesthetic semantics, so it becomes possible to depict images in linguistic expression such as ‘very action’. Furthermore, we apply neural network approach to model the process of human aesthetic perception and to extract the fuzzy aesthetic semantic feature vector. The art image retrieval system based on fuzzy aesthetic semantic feature makes users more naturally search desired images by linguistic expression. We report extensive empirical studies based on a 5000-image set, and experimental results demonstrate that the proposed approach achieves excellent performance in terms of retrieval accuracy

Distributed data mining in grid computing environments

The official published version of this article can be found at the link below.The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an effective scheduling framework. DDM often shares the computing paradigm of local processing and global synthesizing. It involves every phase of Data Mining (DM) processes, which makes the workflow of DDM very complex and can be modelled only by a Directed Acyclic Graph (DAG) with multiple data entries. Motivated by the need for a practical solution of the Grid scheduling problem for the DDM workflow, this paper proposes a novel two-phase scheduling framework, including External Scheduling and Internal Scheduling, on a two-level Grid architecture (InterGrid, IntraGrid). Currently a DM IntraGrid, named DMGCE (Data Mining Grid Computing Environment), has been developed with a dynamic scheduling framework for competitive DAGs in a heterogeneous computing environment. This system is implemented in an established Multi-Agent System (MAS) environment, in which the reuse of existing DM algorithms is achieved by encapsulating them into agents. Practical classification problems from oil well logging analysis are used to measure the system performance. The detailed experiment procedure and result analysis are also discussed in this paper

Perceptual Learning and Abstraction in Machine Learning : an application to autonomous robotics

This paper deals with the possible benefits of Perceptual Learning in Artificial Intelligence. On the one hand, Perceptual Learning is more and more studied in neurobiology and is now considered as an essential part of any living system. In fact, Perceptual Learning and Cognitive Learning are both necessary for learning and often depends on each other. On the other hand, many works in Machine Learning are concerned with "Abstraction" in order to reduce the amount of complexity related to some learning tasks. In the Abstraction framework, Perceptual Learning can be seen as a specific process that learns how to transform the data before the traditional learning task itself takes place. In this paper, we argue that biologically-inspired Perceptual Learning mechanisms could be used to build efficient low-level Abstraction operators that deal with real world data. To illustrate this, we present an application where perceptual learning inspired meta-operators are used to perform an abstraction on an autonomous robot visual perception. The goal of this work is to enable the robot to learn how to identify objects it encounters in its environment

Facilitating dynamic web service composition with fine-granularity context management

Context is an important factor for the success of dynamic service composition. Although many contextbased AI or workflow approaches have been proposed to support dynamic service composition, there is still an unaddressed issue of the support of fine-granularity context management. In this paper, we propose a granularity-based context model together with an approach to supporting the intelligent context-aware service composing problem. The corresponding case study is provided to show the validity of our approach.<br /

A Context Model for Service Composition Based on Dynamic Description Logic

Abstract: A service composition task for service broker is to discovery and compose provider&apos;s services to satisfy user&apos;s request. Many researchers model the context utilizing ontology-based or attribute-based method to assist service composition. We propose a new context model by combining the context logic with the dynamic description logic (DDL), where user&apos; context, provider&apos;s context and broker&apos;s context are described by DDL separately and reasoned under the context logic. The reasoning results finally can be used to discovery and compose services intelligently. We evaluate this model on a simple, yet realistic example, and the results show that our context model provides a practical solution